Johnson-Lindenstrauss notes
نویسنده
چکیده
PrA∼D [∣∣‖Ax‖22 − 1∣∣ > ε] < δ. Lemma 2 implies Lemma 1, since we can set δ = 1/n2 then apply a union bound on the vectors (xi − xj)/‖xi − xj‖2 for all i < j. The first proof of Lemma 2 was given by [15]. Since then, several proofs have been given where D can be taken as a distribution over matrices with independent Gaussian or Bernoulli entries, or even more generally, Ω(log(1/δ))-wise independent entries which each have mean 0, variance 1/k, and a subGaussian tail1; see the proofs in [1, 6, 7, 9, 11, 14, 16, 18]).
منابع مشابه
A Summary of Some Interesting Bounds in Estimation and Learning
These review notes serve as a guide for myself to some bounds of interest in the estimation theory and learning theory, including Cramér-Rao Bound (CRB), concentration inequalities, Vapnic-Chervonenkis (VC) theory, probably approximately correct (PAC) learning, and the Johnson-Lindenstrauss (JL) lemma.
متن کامل236779: Foundations of Algorithms for Massive Datasets Lecture 4 the Johnson-lindenstrauss Lemma
The Johnson-Lindenstrauss lemma and its proof This lecture aims to prove the Johnson–Lindenstrauss lemma. Since the lemma is proved easily with another interesting lemma, a part of this lecture is focused on the proof of this second lemma. At the end, the optimality of the Johnson–Lindenstrauss lemma is discussed. Lemma 1 (Johnson-Lindenstrauss). Given the initial space X ⊆ R n s.t. |X| = N , <...
متن کاملJohnson-lindenstrauss Transformation and Random Projection
We give a brief survey of Johnson-Lindenstrauss lemma. CONTENTS
متن کاملSolving LP using random projections
A celebrated result of Johnson and Lindenstrauss asserts that, in high enough dimensional spaces, Euclidean distances defined by a finite set of points are approximately preserved when these points are projected to a certain lower dimensional space. We show that the distance from a point to a convex set is another approximate invariant, and leverage this result to approximately solve linear pro...
متن کاملThe Fast Johnson-lindenstrauss Transform
While we omit the proof, we remark that it is constructive. Specifically, A is a linear map consisting of random projections onto subspaces of Rd. These projections can be computed by n matrix multiplications, which take time O(nkd). This is fast enough to make the Johnson-Lindenstrauss transform (JLT) a practical and widespread algorithm for dimensionality reduction, which in turn motivates th...
متن کاملAn Elementary Proof of the Johnson-lindenstrauss Lemma
The Johnson-Lindenstrauss lemma shows that a set of n points in high dimensional Euclidean space can be mapped down into an O(log n== 2) dimensional Euclidean space such that the distance between any two points changes by only a factor of (1). In this note, we prove this lemma using elementary probabilistic techniques.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010